Brass: A Queueing Manager for Warrick
نویسندگان
چکیده
When an individual loses their website and a backup cannot be found, they can download and run Warrick, a webrepository crawler which will recover their lost website by crawling the holdings of the Internet Archive and several search engine caches. Running Warrick locally requires some technical know-how, so we have created an on-line queueing system called Brass which simplifies the task of recovering lost websites. We discuss the technical aspects of reconstructing websites and the implementation of Brass. Our newly developed system allows anyone to recover a lost website with a few mouse clicks and allows us to track which websites the public is most interested in saving.
منابع مشابه
A queueing network model of Oracle Parallel Server
An approach to modelling an Oracle database is presented for both single instance and parallel server versions. A modified queueing network is used which is extended to include traditional transaction locks which achieve serialisation and the new PCM locks of Oracle which ensure coherency in the distributed database buffers. The latter are not enqueue locks and so require different techniques. ...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملOptimal pricing for a GI/M/k/N queue with several customer types and holding costs
This paper studies optimal pricing for a GI/M/k/N queueing system with several types of customers. An arrival joins the queue, if the price of service is not higher than the maximum amount that the arrival is willing to pay, and this maximum amount is defined by the customer type. A system manager chooses a price depending on the number of customers in the system. In addition, the system incurs...
متن کاملOn scheduling a multiclass queue with abandonments under general delay costs
We consider a multiclass queueing system with abandonments and general delay costs. A system manager makes dynamic scheduling decisions to minimize long-run average delay and abandonment costs. We consider the three types of delay cost: (i) linear, (ii) convex, and (iii) convex–concave, where the last one corresponds to settings where customers may have a particular deadline in mind but once th...
متن کاملA Quantitative Analysis of the Contract Net Protocol
The Contract Net Protocol (CNP) [Smith, 1980] assigns a subtask to agents which are involved in multiagent problem solving. Although the logical aspects of the negotiation protocol have been analyzed, the properties of protocol dynamics remain unclear. This paper introduces our quantitative analysis of protocol dynamics which is essential for constructing continuous reaitime applications. We ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007